Ordered term tree languages which are polynomial time inductively inferable from positive data
نویسندگان
چکیده
منابع مشابه
Polynomial Time Inductive Inference of Ordered Tree Patterns with Internal Structured Variables from Positive Data
Tree structured data such as HTML/XML files are represented by rooted trees with ordered children and edge labels. As a representation of a tree structured pattern in such tree structured data, we propose an ordered tree pattern, called a term tree, which is a rooted tree pattern consisting of ordered children and internal structured variables. A term tree is a generalization of standard tree p...
متن کاملEfficient Learning of Ordered Tree Patterns with Internal Structured Variables
We show that some foundamental classes of ordered tree pattern languages are polynomial time inductively inferable from positive data and exactly learnable in polynomial time using queries. We report experimental results on applying our learnining method to a collection of tree structured data.
متن کاملA Polynomial Time Matching Algorithm of Structured Ordered Tree Patterns for Data Mining from Semistructured Data
Tree structured data such as HTML/XML files are represented by rooted trees with ordered children and edge labels. Knowledge representations for tree structured data are quite important to discover interesting features which such tree structured data have. In this paper, as a representation of structural features we propose a structured ordered tree pattern, called a term tree, which is a roote...
متن کاملMembrane Systems Languages Are Polynomial-Time Parsable
The focus of this paper is the family of languages generated by transitional non-cooperative P systems without further ingredients. This family can also be defined by so-called time yields of derivation trees of context-free grammars. In this paper we prove that such languages can be parsed in polynomial time, where the degree of polynomial may depend on the number of rules and on the size of t...
متن کاملPolynomial Time Inductive Inference of Cograph Pattern Languages from Positive Data
A cograph is a graph which can be generated by disjoint union and complement operations on graphs, starting with a single vertex graph. Toward effective data mining for graph structured data, we introduce a graph pattern expression, called a cograph pattern, based on cographs. We show that the class of cograph pattern languages is polynomial time inductively inferable from positive data.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2006
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2005.10.022